On the Expressiveness of MTL with Past Operators
نویسندگان
چکیده
We compare the expressiveness of variants of Metric Temporal Logic (MTL) obtained by adding the past operators ‘S’ and ‘SI ’. We consider these variants under the “pointwise” and “continuous” interpretations over both finite and infinite models. Among other results, we show that for each of these variants the continuous version is strictly more expressive than the pointwise version. We also prove a counterfreeness result for MTL which helps to carry over some results from [3] for the case of infinite models to the case of finite models.
منابع مشابه
On the Expressiveness of MTL Variants over Dense Time
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or not, and matching (when it requires its two arguments to eventually hold together) or not. This paper compares the relative expressiveness of the resulting MTL variants over dense time. We prove that the expressivenes...
متن کاملComparing Expressive Power of Timed Logics BTP report
Timed temporal logics encompass a huge diversity of operators, as a result of which, the decidability and expressiveness properties vary considerably. Both pointwise and continuous interpretations of temporal logics can be defined (over finite words), and properties vary based on the interpretation too. The EhrenfeuchtFräıssé games (EF games) for Linear Temporal Logic, as defined by Etessami-Wi...
متن کاملThe expressiveness of MTL with counting
It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting modalities Cn that assert a properties holds n times in the next time interval. We show that MTL with the counting modalities, MTL+C, is expressively complete for FO(<,+1). This result strongly supports the assertion...
متن کاملOn-Line Monitoring for Temporal Logic Robustness
In this paper, we provide a Dynamic Programming algorithm for online monitoring of the state robustness of Metric Temporal Logic specifications with past time operators. We compute the robustness of MTL with unbounded past and bounded future temporal operators (MTL<+∞ +pt ) over sampled traces of Cyber-Physical Systems. We implemented our tool in Matlab as a Simulink block that can be used in a...
متن کاملOn the Expressiveness of Metric Temporal Logic over Bounded Timed Words
It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<,+1]) in the pointwise semantics over bounded time domains (i.e., timed words of bounded duration) [2]. In this paper, we present an extension of MTL, relying on two new temporal operators ‘Earlier’ (E) and ‘Newer’ (N), which has the same expressive power as FO[<,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006